GoMIC: Multi-view image clustering via self-supervised contrastive heterogeneous graph co-learning
نویسندگان
چکیده
Abstract Graph learning is being increasingly applied to image clustering reveal intra-class and inter-class relationships in data. However, existing graph learning-based focuses on grouping images under a single view, which under-utilises the information provided by To address that, we propose self-supervised multi-view technique contrastive heterogeneous learning. Our method computes affinity for It conducts Local Feature Propagation (LFP) reasoning over local neighbourhood of each node executes an Influence-aware (IFP) from its influential intention. The proposed framework pioneeringly employs two objectives. first targets contrast fuse multiple views overall LFP embedding, second maximises mutual between IFP representations. We conduct extensive experiments benchmark datasets problem, i.e. COIL-20, Caltech7 CASIA-WebFace. evaluation shows that our outperforms state-of-the-art methods, including popular techniques MVGL, MCGC HeCo.
منابع مشابه
Multi-view Self-Paced Learning for Clustering
Exploiting the information from multiple views can improve clustering accuracy. However, most existing multi-view clustering algorithms are nonconvex and are thus prone to becoming stuck into bad local minima, especially when there are outliers and missing data. To overcome this problem, we present a new multi-view self-paced learning (MSPL) algorithm for clustering, that learns the multi-view ...
متن کاملLarge-Scale Multi-View Spectral Clustering via Bipartite Graph
In this paper, we address the problem of large-scale multi-view spectral clustering. In many real-world applications, data can be represented in various heterogeneous features or views. Different views often provide different aspects of information that are complementary to each other. Several previous methods of clustering have demonstrated that better accuracy can be achieved using integrated...
متن کاملMulti-view Sparse Co-clustering via Proximal Alternating Linearized Minimization
When multiple views of data are available for a set of subjects, co-clustering aims to identify subject clusters that agree across the different views. We explore the problem of co-clustering when the underlying clusters exist in different subspaces of each view. We propose a proximal alternating linearized minimization algorithm that simultaneously decomposes multiple data matrices into sparse...
متن کاملHeterogeneous Transfer Learning for Image Clustering via the SocialWeb
In this paper, we present a new learning scenario, heterogeneous transfer learning, which improves learning performance when the data can be in different feature spaces and where no correspondence between data instances in these spaces is provided. In the past, we have classified Chinese text documents using English training data under the heterogeneous transfer learning framework. In this pape...
متن کاملTime-Contrastive Networks: Self-Supervised Learning from Video
We propose a self-supervised approach for learning representations and robotic behaviors entirely from unlabeled videos recorded from multiple viewpoints, and study how this representation can be used in two robotic imitation settings: imitating object interactions from videos of humans, and imitating human poses. Imitation of human behavior requires a viewpoint-invariant representation that ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: World Wide Web
سال: 2022
ISSN: ['1573-1413', '1386-145X']
DOI: https://doi.org/10.1007/s11280-022-01110-6